Irreducible Graphs
نویسندگان
چکیده
A connected graph on three or more vertices is said to be irreducible if it has no leaves, and if each vertex has a unique neighbor set. A connected graph on one or two vertices is also said to be irreducible, and a disconnected graph is irreducible if each of its connected components is irreducible. In this paper, we study the class of irreducible graphs. In particular, we consider an algorithm that, for each connected graph Γ, yields an irreducible subgraph I(Γ) of Γ. We show that this subgraph is unique up to isomorphism. We also show that almost all graphs are irreducible. We then conclude by highlighting some structural similarities between I(Γ) and Γ.
منابع مشابه
On the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
متن کاملIrreducible pseudo 2-factor isomorphic cubic bipartite graphs
A bipartite graph is pseudo 2–factor isomorphic if all its 2–factors have the same parity of number of circuits. In a previous paper we have proved that pseudo 2–factor isomorphic k–regular bipartite graphs exist only for k ≤ 3, and partially characterized them. In particular we proved that the only essentially 4–edge-connected pseudo 2–factor isomorphic cubic bipartite graph of girth 4 is K3,3...
متن کاملCounting Labelled Projective-planar Graphs without a K 3,3 -subdivision *
We consider the class F of labelled 2-connected non-planar graphs without a K3,3-subdivision that are embeddable in the projective plane. A method of enumerating these graphs is described. We also enumerate the homeomorphically irreducible graphs in F and homeomorphically irreducible 2-connected planar graphs. The methods are based on the projective-planarity characterization for graphs without...
متن کاملClique irreducibility of some iterative classes of graphs
In this paper, two notions, the clique irreducibility and clique vertex irreducibility are discussed. A graph G is clique irreducible if every clique in G of size at least two, has an edge which does not lie in any other clique of G and it is clique vertex irreducible if every clique in G has a vertex which does not lie in any other clique of G. It is proved that L(G) is clique irreducible if a...
متن کاملClique Irreducibility and Clique Vertex Irreducibility of Graphs
A graphs G is clique irreducible if every clique in G of size at least two, has an edge which does not lie in any other clique of G and is clique reducible if it is not clique irreducible. A graph G is clique vertex irreducible if every clique in G has a vertex which does not lie in any other clique of G and clique vertex reducible if it is not clique vertex irreducible. The clique vertex irred...
متن کامل